The Synchronized Dynamic Vehicle Dispatching Problem
نویسندگان
چکیده
This paper solves a particular class of Real Time Vehicle Dispatching Problems where there is need to service some customers with multiple resources subject to synchronization constraints. Real world applications are presented and a flexible heuristic based on Constraint Programming is proposed. In order to facilitate future comparisons, benchmark instances are derived from well-known vehicle routing benchmark instances and a transformation method is detailed. Results on instances containing up to 1000 requests show that solutions are sensitive to the number of synchronization constraints as well as to the requests’ arrival rate.
منابع مشابه
New scheduling rules for a dynamic flexible flow line problem with sequence-dependent setup times
In the literature, the application of multi-objective dynamic scheduling problem and simple priority rules are widely studied. Although these rules are not efficient enough due to simplicity and lack of general insight, composite dispatching rules have a very suitable performance because they result from experiments. In this paper, a dynamic flexible flow line problem with sequence-dependent se...
متن کاملThe Synchronized Vehicle Dispatching Problem
The synchronized Vehicle Dispatching Problem (SVDP) is a transportation problem that arises in many real world situations. One that illustrates well this problem is special version of the Dial-a-Ride problem, in which some disabled persons require assistance in order to prepare for transportation. In this case, a special team is sent to the residence of the special customer a few minutes before...
متن کاملA time-dependent vehicle routing problem for disaster response phase in multi-graph-based network
Logistics planning in disaster response phase involves dispatching commodities such as medical materials, personnel, food, etc. to affected areas as soon as possible to accelerate the relief operations. Since transportation vehicles in disaster situations can be considered as scarce resources, thus, the efficient usage of them is substantially important. In this study, we provide a dynamic vehi...
متن کاملDispatching Vehicles Considering Uncertain Handling times at Port Container Terminals
This paper considers the problem of vehicle dispatching at port container terminals in a dynamic environment. The problem deals with the assignment of delivery orders of containers to vehicles while taking into consideration the uncertainty in the travel times of the vehicles. Thus, a real-time vehicle dispatching algorithm is proposed for adaptation to the dynamic changes in the states of the ...
متن کاملA Mathematical Model to Optimize Allocation Sequence in Dispatching Problem
Truck-Shovel fleet, as the most common transportation system in open-pit mines, has a significant part of mining costs, for which optimal management can lead to substantial cost reductions. Among the available dispatch mathematical models, the multi-stage approach is well suited for allocating trucks to respected shovels in a dynamic dispatching program. However, with this kind of modeling sequ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- INFOR
دوره 51 شماره
صفحات -
تاریخ انتشار 2013